Smooth-hilbert Space-filling Curve for Minimizng Traversal Complexity in Covering a Monitoring Area
نویسندگان
چکیده
Mobility strategies for a sink node in WSNs serve to move the sink in traversing a monitoring area to collect data from the sensor field and reduce communication relay and thus maximize network lifetime. For periodic data collection, in-order traversal is required. This paper discusses the various in-order mobility strategies in covering an area of interest. Simulation result shows that linear Hilbert space-filling curve produces high percentage of switching direction which adds on to traversal complexity. This complexity is eliminated using curvature path called Smooth-Hilbert.
منابع مشابه
On the metric properties of discrete space-filling curves
A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve "locality". We quantify "locality" and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality.
متن کاملSixteen space-filling curves and traversals for d-dimensional cubes and simplices
This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain applications. Some of the traversals are novel, some have been known in principle but had not been described adequately for any number of dimensions, some of the t...
متن کاملOptimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves
of the Thesis Optimizing Cache Behavior of Ray-Driven Volume Rendering Using Space-Filling Curves by Oleg Mishchenko Master of Science in Computer Science Stony Brook University 2006 We study the cache behavior of space-filling curves in the context of volume rendering with raycasting. An efficient bit-oriented algorithm for 3D Hilbert curve traversal is also proposed. We find that data organiz...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملApproximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves
A discrete space-filling curve provides a linear traversal/indexing of a multi-dimensional grid space. This paper presents an application of random walk to the study of inter-clustering of space-filling curves and an analytical study on the inter-clustering performances of 2-dimensional Hilbert and z-order curve families. Two underlying measures are employed: the mean inter-cluster distance ove...
متن کامل